Predicate Transformer Semantics for Hybrid Systems
نویسندگان
چکیده
Abstract We present a semantic framework for the deductive verification of hybrid systems with Isabelle/HOL. It supports reasoning about temporal evolutions programs in style differential dynamic logic modelled by flows or invariant sets vector fields. introduce foundations this and summarise their Isabelle formalisation as well resulting components. A series simple examples shows our approach at work.
منابع مشابه
A Predicate Transformer Semantics for a Concurrent Language of Refinement
Circus is a combination of Z and CSP; its chief distinguishing feature is the inclusion of the ideas of the refinement calculus. Our main objective is the definition of refinement methods for concurrent programs. The original semantic model for Circus is Hoare and He’s unifying theories of programming. In this paper, we present an equivalent semantics based on predicate transformers. With this ...
متن کاملA Predicate/State Transformer Semantics for Bayesian Learning
This paper establishes a link between Bayesian inference (learning) and predicate and state transformer operations from programming semantics and logic. Specifically, a very general definition of backward inference is given via first applying a predicate transformer and then conditioning. Analogously, forward inference involves first conditioning and then applying a state transformer. These def...
متن کاملOn the equivalence of state transformer semantics and predicate transformer semantics
G. Plotkin and the author [13] have worked out the equivalence between state transformer semantics and predicate transformer semantics in a domain theoretical setting for programs combining nondeterminism and probability. Works of C. Morgan and co-authors [20], Keimel, Rosenbusch and Streicher [14, 15], already go in the same direction using only discrete state spaces. In fact, Keimel and Plotk...
متن کاملRelating State Transformation Semantics and Predicate Transformer Semantics for Parallel Programs
A state transformation semantics and a predicate transformer semantics for programs built from atomic actions, sequential composition, nondeterministic choice, parallel composition, atomisation, and recursion are presented. Both semantic models are derived from some SOS-style labelled transition system. The state transformation semantics and the predicate transformer semantics are shown to be i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Automated Reasoning
سال: 2021
ISSN: ['0168-7433', '1573-0670']
DOI: https://doi.org/10.1007/s10817-021-09607-x